Compatibility scoring of users in a social network

ABSTRACT

The compatibility score of individuals in a social network is computed based on the compatibility of interests expressed by these individuals. The compatibility score between any two interests is calculated as the log of the estimated probability that a member of the social network will express both interests as his/her interests divided by the product of: (i) the estimated probability that a member of the social network will express the first of the two interests as his/her interest and (ii) the estimated probability that a member of the social network will express the second of the two interests as his/her interest. The compatibility score between two individuals is calculated as the sum of the compatibility scores between each interest appearing in a set of interests expressed by the first of the two individuals and each interest appearing in a set of interests expressed by the second of the two individuals.

RELATED APPLICATIONS

The present application is a continuation of U.S. patent applicationSer. No. 12/242,562, filed Sep. 30, 2008, and entitled “CompatibilityScoring of Users in a Social Network,” which is a divisional of U.S.patent application Ser. No. 11/117,793, filed Apr. 28, 2005, andentitled “Compatibility Scoring of Users in a Social Network.”

BACKGROUND

The present invention generally relates to processing of social networkdata, and more particularly, to a method for scoring compatibilitybetween members of an online social network.

Several online dating and friend-making sites currently operate on theInternet. These services are generally similar in function. They allowusers to post profiles and photos, as well as search through theprofiles and photos of other users. Communication between users isprovided anonymously, since users are identified by pseudonyms.

Initially, these sites implemented rudimentary techniques to matchusers. These techniques amounted to no more than user profile searchesbased on criteria such as age, gender, location, and physicalcharacteristics. More recently, these sites have implemented moresophisticated processes in an effort to find better matches for theirusers. These processes attempt to assess an individual's personalitybased on specially designed tests or questionnaires and find users whohave compatible personalities.

INTRODUCTION

The present invention bases compatibility of two individuals who aremembers of a social network on the compatibility of interests expressedby these individuals, and provides for methods for quantifyingcompatibility of interests, scoring compatibility of the two individualsin accordance with compatibility of interests expressed by theseindividuals, and presenting compatibility results that include thecompatibility scores.

The method of quantifying compatibility of interests includes the stepsof calculating an estimated probability associated with each interest(referred to herein as “interest probability”) and each pair ofinterests (referred to herein as “joint probability”), and assigning aninterest compatibility score between each pair of interests based on theestimated probabilities. The estimated interest probability for aparticular interest represents the probability that a member of thesocial network will express that interest as one of his or herinterests. The estimated joint probability for a particular pair ofinterests represents the probability that a member of the social networkwill express both interests in the pair as his or her interests.

In accordance with one embodiment of the present invention, the interestcompatibility score between each pair of interests is computed as afunction of the estimated joint probability for the pair, and theestimated interest probabilities for the first and second interests ofthe pair.

The method of scoring compatibility in accordance with compatibility ofinterests includes the steps of preparing interest compatibility scoresbased on expressed interests of the members of the social network, andcomputing a compatibility score between a first member of the socialnetwork and a second member of the social network based on expressedinterests of the first member, expressed interests of the second member,and the interest compatibility scores between the expressed interests ofthe first member and the expressed interests of the second member. Theinterest compatibility score for any two expressed interests representsthe degree of compatibility between the two expressed interests.

The method of presenting compatibility results that include thecompatibility scores, e.g., to an individual in the social network,includes the steps of preparing interest compatibility scores based onexpressed interests of the individuals in the social network, selectinga set of individuals who are within a predetermined degree of separationfrom the first individual, and computing a compatibility score betweenthe first individual and each of the individuals in the set. If thepredetermined degree of separation is set as one, this means that onlythe compatibility scores of the first individual's direct friends willbe presented. The compatibility results that include the compatibilityscores are presented as a web page and before the web page istransmitted to be displayed, the compatibility results are sorted in theorder of the compatibility scores. By providing compatibility scores andlinking it to interest profiles, the invention encourages people toenter interests so the site can find other people who share the same orcompatible interests.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above recited features of the presentinvention can be understood in detail, a more particular description ofthe invention, briefly summarized above, may be had by reference toembodiments, some of which are illustrated in the appended drawings. Itis to be noted, however, that the appended drawings illustrate onlytypical embodiments of this invention and are therefore not to beconsidered limiting of its scope, for the invention may admit to otherequally effective embodiments.

FIG. 1 is a diagram that graphically represents the relationshipsbetween members in a social network;

FIG. 2 is a block diagram illustrating components of a system formanaging an online social network;

FIG. 3 schematically illustrates the process for computing interestcompatibility data from a member database containing interest data;

FIG. 4 is a flow diagram illustrating the process steps for computinginterest compatibility data from a member database containing interestdata;

FIG. 5 is a flow diagram illustrating the process steps for computing acompatibility score between two members of a social network according toan embodiment of the present invention;

FIG. 6 is a flow diagram illustrating the process steps for generating amember search results page containing compatibility scores;

FIG. 7 is a sample GUI used to specify member search criteria;

FIG. 8 is a sample member search results page containing compatibilityscores; and

FIG. 9 is a flow diagram illustrating the process steps for computing acompatibility score between two members of a social network according toanother embodiment of the present invention.

DESCRIPTION OF PARTICULAR EMBODIMENT(S)

FIG. 1 is a graph representation of a social network centered on a givenindividual (ME). Other members of this social network include A-U whoseposition, relative to ME's, is referred to by the degree of separationbetween ME and each other member. Friends of ME, which includes A, B,and C, are separated from ME by one degree of separation (1 d/s). Afriend of a friend of ME is separated from ME by 2 d/s. As shown, D, E,F, G, and H are each separated from ME by 2 d/s. A friend of a friend ofa friend of ME is separated from ME by 3 d/s. FIG. 1 depicts all nodesseparated from ME by more than 3 degrees of separation as belonging tothe category ALL.

Degrees of separation in a social network are defined relative to anindividual. For example, in ME's social network, H and ME are separatedby 2 d/s, whereas in G's social network, H and G are separated by only 1d/s. Accordingly, each individual will have their own set of first,second and third degree relationships.

As those skilled in the art understand, an individual's social networkmay be extended to include nodes to an Nth degree of separation. As thenumber of degrees increases beyond three, however, the number of nodestypically grows at an explosive rate and quickly begins to mirror theALL set.

FIG. 2 is a block diagram illustrating a system for creating andmanaging an online social network. As shown, FIG. 2 illustrates a system250 that includes an application server 251 and one or more graphservers 252. The system 250 is connected to a network 260, e.g., theInternet, and accessible over the network by a plurality of computers,collectively designated as 270. The application server 250 manages amember database 254, a relationship database 255, and a search database256. The member database 254 contains profile information for each ofthe members in the online social network managed by the system 250. Theprofile information may include, among other things: a unique memberidentifier, name, age, gender, location, hometown, references to imagefiles, listing of interests, attributes, and the like. The relationshipdatabase 255 stores information defining to the first degreerelationships between members. In addition, the contents of the memberdatabase 254 are indexed and optimized for search, and stored in thesearch database 256. The member database 254, the relationship database255, and the search database 256 are updated to reflect inputs of newmember information and edits of existing member information that aremade through the computers 270.

The application server 250 also manages the information exchangerequests that it receives from the remote computers 270. The graphservers 252 receive a query from the application server 251, process thequery and return the query results to the application server 252. Thegraph servers 252 manage a representation of the social network for allthe members in the member database. The graph servers 252 have adedicated memory device 253, such as a random access memory (RAM), inwhich an adjacency list that indicates all first degree relationships inthe social network is stored. The graph servers 252 respond to requestsfrom application server 251 to identify relationships and the degree ofseparation between members of the online social network.

FIG. 3 illustrates the member database 254 in additional detail andshows that the interest data stored therein is first converted into aset 310 of normalized interests and then to a matrix 320 of interestcompatibility scores. The conversion into normalized interests and thento interest compatibility scores is performed by a processing unit ofthe application server 251.

The interest normalization process is in essence an interestclassification process. It is performed so that the same interestexpressed in different ways will be classified under that same interest.For example, an interest expressed as reading may be classified underthe same normalized interest as an interest expressed as books. In theset 310 of normalized interests shown in FIG. 3, the normalizedinterests are shown as a list. In an alternative embodiment, thenormalized interests may be arranged as a hierarchical tree. Further,the present invention may be applied to systems where members inputinterests by selecting one or more interests that have been pre-definedby the system operator. In such a case, the normalization step is notperformed and the set of pre-defined interests is used as the set 310 ofnormalized interests.

The matrix 320 of interest compatibility scores provides numericalscores that represent how compatible each pair of normalized interests,Interest1, Interest2, . . . , InterestN, is. Each off-diagonal cell inthe matrix 320 has a numerical score entry that indicates thecompatibility of the two interests associated with that cell's row andcolumn. Each diagonal cell in the matrix 320 has a numerical score entrythat is a measure of the rarity of the interests associated with thatcell's row and column. A rare interest has a high score. A commonlyoccurring interest has a low score. In the embodiment of the presentinvention illustrated herein, the interest compatibility scores arecompiled automatically based on the expressed interests of the membersthat have been normalized. The interest compatibility scores can also bemanually created or they can be created using a combination of automaticand manual processes. Further, any of the interest compatibility scoresthat are compiled automatically may be manually adjusted.

FIG. 4 is a flow diagram that illustrates the process steps involved ingenerating the matrix 320. In Step 410, all expressed interests storedin the member database 254 are normalized into the set 310 of normalizedinterests, Interest1, Interest2, InterestN. A standard data miningmethodology known as clustering can be used in Step 410. For eachnormalized interest, I, the probability, P(I), is calculated (Step 411).P(I) represents the probability that a member will express an interestthat corresponds to the normalized interest, I, and is calculated usingthe expressed interests stored in the member database 254 according tothe formula: P(I)=(number of times an interest corresponding to thenormalized interest, I, is expressed in the member database 254)/(totalnumber of expressed interests in the member database 254). For each pairof normalized interests, I1 and I2, the probability, P(I1, I2), iscalculated (Step 412). P(I1, I2) represents the probability that amember will express interests that correspond to the normalizedinterests, I1 and I2, and is calculated using the expressed interestsstored in the member database 254 according to the formula: P(I1,I2)=(number of members who expressed interests corresponding to both ofthe normalized interests, I1 and I2, in the member database 254)/(totalnumber of expressed interests in the member database 254). In caseswhere I1=I2, P(I1, I2) is set to P(I1) or P(I2). In Step 413, aninterest compatibility score, S(Ii, Ij), is calculated between each pairof normalized interests using the formula: S(Ii, Ij)=log [P(Ii,Ij)/(P(Ii)*P(Ij))]. Because of the division by [P(Ii)*P(Ij)], using thisformula, the commonality of rare interests are rated higher thancommonality in more popular interests.

FIG. 5 is a flow diagram that illustrates the process steps executed bythe processor of the application server 251 in computing a compatibilityscore between two members, e.g., a first member and a second member. InStep 510, the expressed interests of the first member are normalizedinto a first set {I1, I2, . . . , Im} of normalized interests, where mrepresents the number of normalized interests in the first set. In Step511, the expressed interests of the second member are normalized into asecond set {J1, J2, . . . , Jn} of normalized interests, where nrepresents the number of normalized interests in the second set. In Step512, the interest compatibility scores for all pairs of normalizedinterests in the first and second sets are determined from the matrix320. For example, if the first set is {Interest_1, Interest_2} and thesecond set is {Interest_2, Interest_3}, the following compatibilityscores are retrieved from the matrix 320:

-   -   Compatibility(Interest_1, Interest_2);    -   Compatibility(Interest_1, Interest_3);    -   Compatibility(Interest_2, Interest_2); and    -   Compatibility(Interest_2, Interest_3).

In Step 513, the compatibility scores determined in Step 512 are summed,and the sum represents the compatibility score between the first memberand the second member.

FIG. 6 is a flow diagram that illustrates the process steps executed bythe processor of the application server 251 in presenting compatiblescores of those members who meet a set of criteria specified by a memberof the social network. In Step 610, the members of the social networkwho meet the specified criteria are selected. A sample graphical userinterface (GUI) for specifying the set of criteria is illustrated inFIG. 7. The GUI 700 shows the criteria that can be specified by themember. They include: age, gender (men, women, men & women), location,purpose of the search, relationship status and keywords in selectedcategories such as hometown, companies, schools, affiliations,interests, favorite movies, favorite books, favorite music, and favoriteTV shows. The GUI 700 also provides a setting for degree of separation(d/s): members who are within 1 d/s, members who are within 2 d/s,members who are within 3 d/s, or all members. After specifying thecriteria, the member clicks on the search button 710, in response towhich the application server 251 performs the search of the members whomeet the specified criteria.

In Step 611, a compatibility score between the member specifying thecriteria and each member of the social network who meets the specifiedsearch criteria is computed. In Step 612, the members of the socialnetwork who meet the specified search criteria are sorted according totheir compatibility scores, and in Step 613, a web page containingimages, mini-profiles, and hyperlinks associated with the members of thesocial network who meet the specified search criteria are transmitted tothe member for display. The web page transmitted in Step 613 isformatted such that the images, mini-profiles, and hyperlinks associatedwith the members are displayed according their compatibility scores(highest to lowest). FIG. 8 shows a sample search results page 800.

The compatibility score between two members can be adjusted based onrelationship information stored for the two members. In one embodiment,the compatibility score between the two members is increased based onthe number of common first through Nth degree friends that the membershave. N is typically set to 2 or 3, but may be any positive integer. Thecompatibility score may be increased in proportion to the number ofcommon first through Nth degree friends that the members have, with theincrease based on first degree friends being weighted higher than theincrease based on second degree friends, and the increase based onsecond degree friends being weighted higher than the increase based onthird degree friends, and so forth.

In another embodiment, the compatibility score between a first member ofthe social network and a second member of the social network is adjustedbased on the commonality of the first member's expressed interest in thefirst member's social network and the commonality of the second member'sexpressed interest in the second member's social network. FIG. 9 is aflow diagram that illustrates the process steps executed by theprocessor of the application server 251 in computing a compatibilityscore between two members, e.g., a first member and a second member,with the adjustment based on the commonality of the first member'sexpressed interest in the first member's social network and thecommonality of the second member's expressed interest in the secondmember's social network.

In Step 910, the expressed interests of the first member are normalizedinto a first set {I1, I2, . . . , Im} of normalized interests, where mrepresents the number of normalized interests in the first set. In Step911, the expressed interests of the second member are normalized into asecond set {J1, J2, . . . , Jn} of normalized interests, where nrepresents the number of normalized interests in the second set. In Step912, the interest compatibility scores for all pairs of normalizedinterests in the first and second sets are determined from the matrix320. For example, if the first set is {Interest_1, Interest_2} and thesecond set is {Interest_2, Interest_3}, the following compatibilityscores are retrieved from the matrix 320:

-   -   Compatibility(Interest_1, Interest_2);    -   Compatibility(Interest_1, Interest_3);    -   Compatibility(Interest_2, Interest_2); and    -   Compatibility(Interest_2, Interest_3).

In Step 913, each of the compatibility scores determined in Step 912 isadjusted based on the commonality of the first member's expressedinterest in the first member's social network and the commonality of thesecond member's expressed interest in the second member's socialnetwork. For example, the adjustments, k12, k13, k22, k23, are made tothe compatibility scores determined in Step 912 as follows:

-   -   k12*Compatibility(Interest_1, Interest_2);    -   k13*Compatibility(Interest_1, Interest_3);    -   k22*Compatibility(Interest_2, Interest_2); and    -   k23*Compatibility(Interest_2, Interest_3).

The adjustment, kij, is a function of the number of first through Nthdegree friends of the first member who have expressed an interestcorresponding to Interest_i and the number of first through Nth degreefriends of the second member who have expressed an interestcorresponding to Interest_j. N is typically set to 3 or 4, but may beany positive integer. The properties of the adjustment, kij, are asfollows:

-   -   1. kij.gtoreq.1;    -   2. kij=kji;    -   3. kij increases in proportion to the number of friends of the        first member who have expressed an interest corresponding to        Interest_i, with the amount of increase being weighted higher        for closer degree friends; and    -   4. kij increases in proportion to the number of friends of the        second member who have expressed an interest corresponding to        Interest_j, with the amount of increase being weighted higher        for closer degree friends.

In Step 914, the adjusted compatibility scores determined in Step 913are summed, and the sum represents the compatibility score between thefirst member and the second member.

While particular embodiments according to the invention have beenillustrated and described above, those skilled in the art understandthat the invention can take a variety of forms and embodiments withinthe scope of the appended claims.

What is claimed is:
 1. A method comprising: receiving a query associatedwith a first member of a social network, the query comprising one ormore keywords within a selected criteria, the first member beingassociated with a first profile information specifying one or morevalues for one or more criteria; selecting, using one or more processorsassociated with one or more computer devices, one or more members of thesocial network based on matching the keywords of the query to values forthe selected criteria, each selected member being associated with asecond profile information specifying one or more values for one or morecriteria; computing, using the one or more processors associated withthe one or more computer devices, compatibility scores for each of theselected members based on the values for each criteria associated withthe first member and the selected member, each compatibility score beingassociated with the first member and one of the selected members; andtransmitting information associated with the selected members.
 2. Themethod of claim 1, wherein at least one keyword is associated with acategory.
 3. The method of claim 2, wherein the category comprises oneor more interests.
 4. The method of claim 1, wherein the query comprisesa degree of separation with respect to the first member.
 5. The methodof claim 1, wherein the query comprises one or more criteria, the one ormore criteria comprising age, gender, location, search purpose,relationship status, hometown, one or more companies, one or moreschools, one or more affiliation, one or more interests, one or morefavorite movies, one or more favorite books, one or more favorite musicselections, one or more favorite TV shows, one or more memberattributes, or any combination thereof.
 6. The method of claim 5,wherein one or more of the one or more keywords is associated with acriteria.
 7. The method of claim 1, wherein selecting one or moremembers of the social network based on the query comprises processingthe query, using a social graph server, the social graph server managinga social graph representing the social network for all members of thesocial network.
 8. The method of claim 1, wherein the transmittedinformation comprises information representing a set of hyperlinks, eachhyperlink being associated with one of the selected members.
 9. Themethod of claim 1, wherein computing a compatibility score associatedwith the first member and the one of the selected one or more memberscomprises determining the number of common friends between the firstmember and the one of the selected one or more members.
 10. The methodof claim 9, wherein the compatibility score is based on weighted valuesassociated with the common friends, the weighted values being associatedwith a degree of separation between the first member and the one of theselected one or more members.
 11. The method of claim 1, wherein theinformation associated with the selected members is transmitted inaccordance with the compatibility scores.
 12. The method of claim 11,wherein transmitting the information associated with the selectedmembers in accordance with the compatibility scores comprises sortingthe information associated with the selected members according to thecompatibility scores.
 13. The method of claim 1, further comprising:normalizing the one or more values of the first profile information ofthe first member to obtain a first set of normalized values for thefirst member; and for each selected member, normalizing the one or morevalues of the second profile information of the selected member toobtain a second set of normalized values for the second member.
 14. Themethod of claim 13, wherein computing compatibility scores for each ofthe selected members is based on the first set of normalized values forthe first member and the second set of normalized values for theselected member.
 15. The method of claim 1, wherein the compatibilityscores for each of the selected members is a probability ofcompatibility of the first member with respect to the selected member,the probability of compatibility being based on each pair of values foreach criteria of the first profile information of the first member andthe second profile information of the second member.
 16. The method ofclaim 1, further comprising receiving a selection of the selectedcriteria from the first member.
 17. The method of claim 1, furthercomprising accessing a social graph comprising a plurality of nodes anda plurality of edges connecting the nodes, each of the one or more ofthe nodes being associated with a plurality of members of the socialnetwork, each connection between two nodes representing a relationshipbetween the two nodes and establishing a single degree of separationbetween the two nodes.
 18. The method of claim 17, wherein: the firstmember is associated with a first node of the plurality of nodes; andeach selected member is associated with a second node of the pluralityof nodes, each second node being within a threshold degree of separationof the first node.
 19. A system, comprising: one or more non-transitorymachine-readable storage media encoded with instructions; and one ormore processors configured to execute the instructions to: receive aquery associated with a first member of a social network, the querycomprising one or more keywords within a selected criteria, the firstmember being associated with a first profile information specifying oneor more values for one or more criteria; select one or more members ofthe social network based on matching the keywords of the query to valuesfor the selected criteria, each selected member being associated with asecond profile information specifying one or more values for one or morecriteria; compute compatibility scores for each of the selected membersbased on the values for each criteria associated with the first memberand the selected member, each compatibility score being associated withthe first member and one of the selected members; and transmitinformation associated with the selected one or more members.
 20. One ormore computer-readable non-transitory storage media embodying softwarethat is operable when executed by one or more processors associated withone or more servers to: receive a query associated with a first memberof a social network, the query comprising one or more keywords within aselected criteria, the first member being associated with a firstprofile information specifying one or more values for one or morecriteria; select, using one or more processors associated with one ormore computer devices, one or more members of the social network basedon matching the keywords of the query to values for the selectedcriteria, each selected member being associated with a second profileinformation specifying one or more values for one or more criteria;compute, using the one or more processors associated with the one ormore computer devices, compatibility scores for each of the selectedmembers based on the values for each criteria associated with the firstmember and the selected member, each compatibility score beingassociated with the first member and one of the selected members; andtransmit information associated with the selected members.